Base-X Notation and Tri-Value Logic
نویسندگان
چکیده
منابع مشابه
A Notation and Logic for Mobile Computing
We deene a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pattern of connectivity among the components changes as they move in and out of proximity. The deenition is general enough to encompass a system of mobile hosts moving in physical space as well as a system of migrating software ag...
متن کاملThe Role of Number Notation: Sign-Value Notation Number Processing is Easier than Place-Value
Number notations can influence the way numbers are handled in computations; however, the role of notation itself in mental processing has not been examined directly. From a mathematical point of view, it is believed that place-value number notation systems, such as the Indo-Arabic numbers, are superior to sign-value systems, such as the Roman numbers. However, sign-value notation might have suf...
متن کاملSpecification Notation based on Higher Order Logic
This paper introduces a new notation called S which is based on higher order logic. It has been developed specifically to support the practical application of formal methods in industrial scale projects. The development of S has occurred in the context of an investigation into the possibility of using formal specification techniques in the development of a $400 million air traffic control syste...
متن کاملSafe Recursion on Notation into a Light Logic by Levels
We embed Safe Recursion on Notation (SRN) into Light Affine Logic by Levels (LALL), derived from the logic ML4. LALL is an intuitionistic deductive system, with a polynomial time cut elimination strategy. The embedding allows to represent every term t of SRN as a family of nets 〈⌈t⌉〉l∈N in LALL. Every net ⌈t⌉l in the family simulates t on arguments whose bit length is bounded by the integer l. ...
متن کاملDescription Logic Knowledge Base Exchange
Let M = { ∀a, t.(AuthorOf(a, t)→ ∃g.BookInfo(t, a, g)) }, I1 = { AuthorOf(nabokov, lolita), AuthorOf(tolkien, lotr) }. Then I2 = { BookInfo(lolita, nabokov, n1), BookInfo(lotr, tolkien, n2) } is a universal solution. Data Exchange Example Let M = { ∃AuthorOf− v ∃BookGenre, AuthorOf− v WrittenBy, TaxNumber v SSN }, T1 = { ∃AuthorOf v Author, Author v ∃TaxNumber }, A1 = { AuthorOf(nabokov, lolita...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Computational Mathematics
سال: 2012
ISSN: 2161-1203,2161-1211
DOI: 10.4236/ajcm.2012.23033